0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.12 % Command : run_E %s %d THM 0.12/0.33 % Computer : n008.cluster.edu 0.12/0.33 % Model : x86_64 x86_64 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.33 % Memory : 8042.1875MB 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.33 % CPULimit : 1440 0.12/0.33 % WCLimit : 180 0.12/0.33 % DateTime : Thu Jul 4 07:13:24 EDT 2024 0.12/0.33 % CPUTime : 0.20/0.47 Running higher-order theorem proving 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.5KvYmBU6f0/E---3.1_5620.p 25.57/3.69 # Version: 3.2.0-ho 25.57/3.69 # Preprocessing class: HSSSSMSSSSSNHHA. 25.57/3.69 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 25.57/3.69 # Starting sh2lt with 720s (4) cores 25.57/3.69 # Starting new_ho_10_unif with 180s (1) cores 25.57/3.69 # Starting full_lambda_6 with 180s (1) cores 25.57/3.69 # Starting post_as_ho1 with 180s (1) cores 25.57/3.69 # Starting ehoh_best3_rw with 180s (1) cores 25.57/3.69 # ehoh_best3_rw with pid 5704 completed with status 0 25.57/3.69 # Result found by ehoh_best3_rw 25.57/3.69 # Preprocessing class: HSSSSMSSSSSNHHA. 25.57/3.69 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 25.57/3.69 # Starting sh2lt with 720s (4) cores 25.57/3.69 # Starting new_ho_10_unif with 180s (1) cores 25.57/3.69 # Starting full_lambda_6 with 180s (1) cores 25.57/3.69 # Starting post_as_ho1 with 180s (1) cores 25.57/3.69 # Starting ehoh_best3_rw with 180s (1) cores 25.57/3.69 # SinE strategy is gf120_gu_RUU_F100_L01000 25.57/3.69 # Search class: HGHNF-FFSF22-SHHFFSBN 25.57/3.69 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 25.57/3.69 # Starting new_ho_10_unif with 54s (1) cores 25.57/3.69 # new_ho_10_unif with pid 5709 completed with status 0 25.57/3.69 # Result found by new_ho_10_unif 25.57/3.69 # Preprocessing class: HSSSSMSSSSSNHHA. 25.57/3.69 # Scheduled 5 strats onto 8 cores with 180 seconds (1440 total) 25.57/3.69 # Starting sh2lt with 720s (4) cores 25.57/3.69 # Starting new_ho_10_unif with 180s (1) cores 25.57/3.69 # Starting full_lambda_6 with 180s (1) cores 25.57/3.69 # Starting post_as_ho1 with 180s (1) cores 25.57/3.69 # Starting ehoh_best3_rw with 180s (1) cores 25.57/3.69 # SinE strategy is gf120_gu_RUU_F100_L01000 25.57/3.69 # Search class: HGHNF-FFSF22-SHHFFSBN 25.57/3.69 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 25.57/3.69 # Starting new_ho_10_unif with 54s (1) cores 25.57/3.69 # Preprocessing time : 0.001 s 25.57/3.69 # Presaturation interreduction done 25.57/3.69 25.57/3.69 # Proof found! 25.57/3.69 # SZS status Theorem 25.57/3.69 # SZS output start CNFRefutation 25.57/3.69 thf(decl_sort1, type, a: $tType). 25.57/3.69 thf(decl_22, type, epred1_0: a > a > $o). 25.57/3.69 thf(decl_23, type, esk1_0: (a > $o) > a). 25.57/3.69 thf(decl_24, type, esk2_2: (a > $o) > a > a). 25.57/3.69 thf(decl_25, type, esk3_0: a > a). 25.57/3.69 thf(cTHM145_C_pme, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:((![X3:a > a]:((?[X4:a]:(((X1 @ X4 @ (X3 @ X4))&(X1 @ (X3 @ X4) @ X4)))<=![X5:a, X6:a]:(((X1 @ (X3 @ X5) @ (X3 @ X6))<=(X1 @ X5 @ X6)))))<=(![X7:a > $o]:((![X8:a]:(((X1 @ X8 @ (X2 @ X7))<=(X7 @ X8)))&![X9:a]:((![X10:a]:(((X1 @ X10 @ X9)<=((X7 @ X10)&(X7 @ X10))))=>((X1 @ (X2 @ X7) @ X9)&(X1 @ (X2 @ X7) @ X9))))))&![X5:a, X6:a, X8:a]:((((X1 @ X5 @ X6)&(X1 @ X6 @ X8))=>(X1 @ X5 @ X8)))))), file('/export/starexec/sandbox/tmp/tmp.5KvYmBU6f0/E---3.1_5620.p', cTHM145_C_pme)). 25.57/3.69 thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:(((![X7:a > $o]:((![X8:a]:(((X7 @ X8)=>(X1 @ X8 @ (X2 @ X7))))&![X9:a]:((![X10:a]:(((X7 @ X10)=>(X1 @ X10 @ X9)))=>(X1 @ (X2 @ X7) @ X9)))))&![X5:a, X6:a, X8:a]:((((X1 @ X5 @ X6)&(X1 @ X6 @ X8))=>(X1 @ X5 @ X8))))=>![X3:a > a]:((![X5:a, X6:a]:(((X1 @ X5 @ X6)=>(X1 @ (X3 @ X5) @ (X3 @ X6))))=>?[X4:a]:(((X1 @ X4 @ (X3 @ X4))&(X1 @ (X3 @ X4) @ X4)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM145_C_pme])])). 25.57/3.69 thf(c_0_2, negated_conjecture, ![X26:a > $o, X27:a, X28:a, X30:a, X31:a, X32:a, X34:a, X35:a, X36:a]:(((((~(X26 @ X27)|(epred1_0 @ X27 @ (esk1_0 @ X26)))&(((X26 @ (esk2_2 @ X26 @ X28))|(epred1_0 @ (esk1_0 @ X26) @ X28))&(~(epred1_0 @ (esk2_2 @ X26 @ X28) @ X28)|(epred1_0 @ (esk1_0 @ X26) @ X28))))&(~(epred1_0 @ X30 @ X31)|~(epred1_0 @ X31 @ X32)|(epred1_0 @ X30 @ X32)))&((~(epred1_0 @ X34 @ X35)|(epred1_0 @ (esk3_0 @ X34) @ (esk3_0 @ X35)))&(~(epred1_0 @ X36 @ (esk3_0 @ X36))|~(epred1_0 @ (esk3_0 @ X36) @ X36))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])). 25.57/3.69 thf(c_0_3, negated_conjecture, ![X4:a, X5:a, X6:a]:(((epred1_0 @ X4 @ X6)|~((epred1_0 @ X4 @ X5))|~((epred1_0 @ X5 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.57/3.69 thf(c_0_4, negated_conjecture, ![X4:a, X5:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.57/3.69 thf(c_0_5, negated_conjecture, ![X4:a, X6:a, X5:a]:(((epred1_0 @ X4 @ (esk3_0 @ X5))|~((epred1_0 @ X4 @ (esk3_0 @ X6)))|~((epred1_0 @ X6 @ X5)))), inference(spm,[status(thm)],[c_0_3, c_0_4])). 25.57/3.69 thf(c_0_6, negated_conjecture, ![X7:a > $o, X4:a]:(((X7 @ (esk2_2 @ X7 @ X4))|(epred1_0 @ (esk1_0 @ X7) @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.57/3.69 thf(c_0_7, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ X4 @ (esk1_0 @ X7))|~((X7 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.57/3.69 thf(c_0_8, negated_conjecture, ![X3:a > a, X4:a, X13:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ (esk3_0 @ X5))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0)))))) @ X4)|~((epred1_0 @ (X13 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ (X3 @ Z0) @ (esk3_0 @ (X13 @ Z0))))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_5, c_0_6])). 25.57/3.69 thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0))) @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((X1 @ Z0 @ Z0)))) @ X4))), inference(spm,[status(thm)],[c_0_7, c_0_6])). 25.57/3.69 thf(c_0_10, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ (esk1_0 @ X7) @ X4)|~((epred1_0 @ (esk2_2 @ X7 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.57/3.69 thf(c_0_11, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_2 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))) @ X4) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ X4))), inference(spm,[status(thm)],[c_0_8, c_0_9])). 25.57/3.69 thf(c_0_12, negated_conjecture, ![X3:a > a, X4:a]:(((epred1_0 @ (esk3_0 @ X4) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ (X3 @ Z0)))))))|~((epred1_0 @ X4 @ (X3 @ (esk3_0 @ X4)))))), inference(spm,[status(thm)],[c_0_7, c_0_4])). 25.57/3.69 thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))) @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])). 25.57/3.69 thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred1_0 @ X4 @ (esk3_0 @ X4)))|~((epred1_0 @ (esk3_0 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])). 25.57/3.69 thf(c_0_15, negated_conjecture, (epred1_0 @ (esk3_0 @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))) @ (esk1_0 @ (^[Z0/* 3 */:a]:((epred1_0 @ Z0 @ (esk3_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])). 25.57/3.69 thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']). 25.57/3.69 # SZS output end CNFRefutation 25.57/3.69 # Parsed axioms : 2 25.57/3.69 # Removed by relevancy pruning/SinE : 1 25.57/3.69 # Initial clauses : 6 25.57/3.69 # Removed in clause preprocessing : 0 25.57/3.69 # Initial clauses in saturation : 6 25.57/3.69 # Processed clauses : 865 25.57/3.69 # ...of these trivial : 128 25.57/3.69 # ...subsumed : 272 25.57/3.69 # ...remaining for further processing : 465 25.57/3.69 # Other redundant clauses eliminated : 0 25.57/3.69 # Clauses deleted for lack of memory : 0 25.57/3.69 # Backward-subsumed : 29 25.57/3.69 # Backward-rewritten : 47 25.57/3.69 # Generated clauses : 48580 25.57/3.69 # ...of the previous two non-redundant : 41700 25.57/3.69 # ...aggressively subsumed : 0 25.57/3.69 # Contextual simplify-reflections : 0 25.57/3.69 # Paramodulations : 48396 25.57/3.69 # Factorizations : 183 25.57/3.69 # NegExts : 0 25.57/3.69 # Equation resolutions : 1 25.57/3.69 # Disequality decompositions : 0 25.57/3.69 # Total rewrite steps : 7285 25.57/3.69 # ...of those cached : 6320 25.57/3.69 # Propositional unsat checks : 0 25.57/3.69 # Propositional check models : 0 25.57/3.69 # Propositional check unsatisfiable : 0 25.57/3.69 # Propositional clauses : 0 25.57/3.69 # Propositional clauses after purity: 0 25.57/3.69 # Propositional unsat core size : 0 25.57/3.69 # Propositional preprocessing time : 0.000 25.57/3.69 # Propositional encoding time : 0.000 25.57/3.69 # Propositional solver time : 0.000 25.57/3.69 # Success case prop preproc time : 0.000 25.57/3.69 # Success case prop encoding time : 0.000 25.57/3.69 # Success case prop solver time : 0.000 25.57/3.69 # Current number of processed clauses : 383 25.57/3.69 # Positive orientable unit clauses : 92 25.57/3.69 # Positive unorientable unit clauses: 0 25.57/3.69 # Negative unit clauses : 15 25.57/3.69 # Non-unit-clauses : 276 25.57/3.69 # Current number of unprocessed clauses: 40342 25.57/3.69 # ...number of literals in the above : 125900 25.57/3.69 # Current number of archived formulas : 0 25.57/3.69 # Current number of archived clauses : 82 25.57/3.69 # Clause-clause subsumption calls (NU) : 11966 25.57/3.69 # Rec. Clause-clause subsumption calls : 10032 25.57/3.69 # Non-unit clause-clause subsumptions : 293 25.57/3.69 # Unit Clause-clause subsumption calls : 2671 25.57/3.69 # Rewrite failures with RHS unbound : 0 25.57/3.69 # BW rewrite match attempts : 2202 25.57/3.69 # BW rewrite match successes : 57 25.57/3.69 # Condensation attempts : 865 25.57/3.69 # Condensation successes : 9 25.57/3.69 # Termbank termtop insertions : 12460699 25.57/3.69 # Search garbage collected termcells : 395 25.57/3.69 25.57/3.69 # ------------------------------------------------- 25.57/3.69 # User time : 3.005 s 25.57/3.69 # System time : 0.141 s 25.57/3.69 # Total time : 3.146 s 25.57/3.69 # Maximum resident set size: 1904 pages 25.57/3.69 25.57/3.69 # ------------------------------------------------- 25.57/3.69 # User time : 3.005 s 25.57/3.69 # System time : 0.144 s 25.57/3.69 # Total time : 3.149 s 25.57/3.69 # Maximum resident set size: 1728 pages 25.57/3.69 % E---3.1 exiting 25.63/3.69 % E exiting 25.63/3.69 EOF